/**
*      author: Y_Yao
*      created: 2025-02-22 13:24:09
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e3 + 7;
int row[N],col[N];
int n;
char a[N][N];

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            cin >> a[i][j];
            if(a[i][j] == 'o')
            {
                row[i]++;
                col[j]++;
            }
        }
    }

    int ans = 0;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            if(a[i][j] == 'o' && row[i] >= 2 && col[j] >= 2)
            {
                ans += (row[i] - 1) * (col[j] - 1); 
            }
        }
    }
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}